TDL - a type description language for constraint based grammars: foundations, implementation, and applications
نویسنده
چکیده
2 Motivation This paper presents "FD~g, a typed feal, ure-bascd rein'csent, el;ion language att(l ild'erence system. Type definitions in TDL consis~ of type and feature constraints over the Imolean cmme(Mves. TD£ supports openand closedworM reasoning over types and allows for par|;itions and iueompal;i[)le I.ypes. Working with l)artially as well as with lhlly expanded types is possible. E[lieienl. reasoning in "]'1)12 is accomplished through Sl)Ccialized mtMules. Tot)teal Pat)er . 7t~pie Area : sofl,w;u'e fin" NI,I', gram-mar ['t)i'midism for Lyl)ed ['e~H.Hi't: st,rut:lures.
منابع مشابه
TDL--- A Type Description Language for Constraint-Based Grammars
This paper presents TDL, a typed feature-based representation language and inference system. Type deeni-tions in TDL consist of type and feature constraints over the boolean connectives. TDL supports open-and closed-world reasoning over types and allows for partitions and incompatible types. Working with partially as well as with fully expanded types is possible. EEcient reasoning in TDL is acc...
متن کاملTDL: A Hardware Description Language for Retargetable Postpass Optimizations and Analyses
The hardware description language Tdl has been designed with the goal to generate machine-dependent postpass optimizers and analyzers from a concise specification of the target processor. Tdl is assembly-oriented and provides a generic modeling of irregular hardware constraints that are typical for many embedded processors. The generic modeling supports graph-based and search-based optimization...
متن کاملClassiication and Representation of Types in Tdl
This paper presents TDL, a typed feature-based representation language and inference system, speciically designed to support highly lexicalized constraint-based grammar theories. Type deenitions in TDL consist of type and feature constraints over the full Boolean con-nectives together with coreferences, thus making TDL Turing-complete. TDL provides open-and closed-world reasoning over types. Wo...
متن کاملCHR grammars
A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules ...
متن کاملProbabilistic constraint logic programming: formal foundations of quantitative and statistical inference in constrained based natural language processing
Structural ambiguity in linguistic analyses is a severe problem for natural language processing. For grammars describing a nontrivial fragment of natural language, every input of reasonable length may receive a large number of analyses, many of which are implausible or spurious. This problem is even harder for highly complex constraint-based grammars. Whereas the mathematical foundation of such...
متن کامل